Quantum-assisted quantum compiling
نویسندگان
چکیده
منابع مشابه
Topological quantum compiling
A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum gates acting on qubits encoded using triplets of these quasiparticles can be built entirely out of three-stranded braids three-braids . These three-braids can...
متن کاملAsymptotically Optimal Topological Quantum Compiling
We address the problem of compiling quantum operations into braid representations for non-Abelian quasiparticles described by the Fibonacci anyon model. We classify the single-qubit unitaries that can be represented exactly by Fibonacci anyon braids and use the classification to develop a probabilistically polynomial algorithm that approximates any given single-qubit unitary to a desired precis...
متن کاملNew methods for Quantum Compiling
The efficiency of compiling high-level quantum algorithms into instruction sets native to quantum computers defines the moment in the future when we will be able to solve interesting and important problems on quantum computers. In my work I focus on the new methods for compiling single qubit operations that appear in many quantum algorithms into single qubit operations natively supported by sev...
متن کاملCompiling Quantum Circuits using the Palindrome Transform
The design and optimization of quantum circuits is central to quantum computation. This paper presents new algorithms for compiling arbitrary 2 ×2 unitary matrices into efficient circuits of (n−1)controlled single-qubit and (n−1)-controlled-NOT gates. We first present a general algebraic optimization technique, which we call the Palindrome Transform, that can be used to minimize the number of s...
متن کاملQuantum Compiling with Approximation of Multiplexors
A quantum compiling algorithm is an algorithm for decomposing (“compiling”) an arbitrary unitary matrix into a sequence of elementary operations (SEO). Suppose Uin is an NB-bit unstructured unitary matrix (a unitary matrix with no special symmetries) that we wish to compile. For NB > 10, expressing Uin as a SEO requires more than a million CNOTs. This calls for a method for finding a unitary ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum
سال: 2019
ISSN: 2521-327X
DOI: 10.22331/q-2019-05-13-140